Optimal program execution reversal
نویسندگان
چکیده
For adjoint calculations, debugging, and similar purposes one may need to reverse the execution of a computer program. The simplest option of recording a complete execution log and then reading it backwards requires massive amounts of storage. Instead one may generate the execution log piecewise by restarting the “forward” calculation repeatedly from suitably placed checkpoints. Our goal is to minimize the temporal and spatial complexity as measured by the number of evaluation repeats and the number of checkpoints, respectively. ∗Institute of Scientific Computing, Technical University Dresden, D-01062 Dresden, Germany. mailto:[email protected] See http://anziamj.austms.org.au/V42/CTAC99/Grie for this article and ancillary services, c © Austral. Mathematical Soc. 2000. Published 27 Nov 2000.
منابع مشابه
Program Development Tools: Debugging by Reverse Computing
More and more program development tools have turned to Web-based. It has an advantage on being a multiplatform tool. This work proposes a debugging tool based on web interface. The main idea of the tool is that the execution of the program can be regarded as a flow. This flow can be captured and played back later. Therefore, any state of the executed program can be analyzed and errors can be pi...
متن کاملMemory Hierarchy Considerations for Fast Transpose and Bit-Reversals
This paper explores the interplay between algorithm design and a computer’s memory hierarchy. Matrix transpose and the bit-reversal reordering are important scientific subroutines which often exhibit severe performance degradation due to cache and TLB associativity problems. We give lower bounds that show for typical memory hierarchy designs, extra data movement is unavoidable. We also prescrib...
متن کاملمکانیابی خطاهای پنهان نرم افزار با استفاده از آنتروپی متقاطع و مدلهای n-گرام
The aim is to automate the process of bug localization in program source code. The cause of program failure could be best determined by comparing and analyzing correct and incorrect execution paths generated by running the instrumented program with different failing and passing test cases. To compare and analysis the execution paths, one approach is clustering the paths according to their simil...
متن کاملPerformance of Parallel Bit-Reversal with Cilk and UPC for Fast Fourier Transform
Bit-reversal is widely known being an important program, as essential part of Fast Fourier Transform. If not carefully and well designed, it may easily take large portion of FFT application’s total execution time. In this paper, we present a parallel implementation of Bit-reversal for FFT using Cilk and UPC. Based on our previous work of creating parallel Bit-reversal using OpenMP in SPMD style...
متن کامل